matching strategy การใช้

• It has claimed that its support was a matching strategy for Brazilian aid to its own upstart jet manufacturer, Embraer SA.
• The BrainAligner is a software that has been used to automate the 3D deformable and nonlinear registration process using a reliable-landmark-matching strategy.
• The implementation of the metric is modular insofar as the algorithms that match words are implemented as modules, and new modules that implement different matching strategies may easily be added.
• The probability-matching strategy is of psychological interest because it is frequently employed by human subjects in decision and classification studies ( where it may be related to Thompson sampling ).
• An unusual characteristic of this merge tool was its use of colored backgrounds and video game-like color-matching strategies for hinting which branch to accept when merging code conflicts.
• It is thought that a similar work could be done about mutually facilitating or constraining strategy loops, so as to constitute a dynamic response to aggravating or reducing loops of problems through a circle of matching strategies.
• Thus, if in the training set positive examples are observed 60 % of the time, and negative examples are observed 40 % of the time, the observer using a probability-matching strategy will predict ( for unlabeled examples ) a class label of " positive " on 60 % of instances, and a class label of " negative " on 40 % of instances.
• Such a promise could be dropped if it ever turned out to be necessary ( with attendant loss of goodwill, but preventing a damaging price war ) but signals to competitors that they should not hope to enter the market by undercutting the incumbent ( if they believe the advertised price-matching strategy would continue post-entry, then they would expect be forced to withdraw unprofitably, and therefore decide against entry ).
• Loosely, the term \ textstyle p ( c _ j ) \ sum _ { f _ i \ in F } \ sum _ { k = 1 } ^ m p ( f _ { ik } | c _ j ) ^ 2 is the expected number of attribute values that can be correctly guessed by an observer using a probability-matching strategy together with knowledge of the category labels, while \ textstyle p ( c _ j ) \ sum _ { f _ i \ in F } \ sum _ { k = 1 } ^ m p ( f _ { ik } ) ^ 2 is the expected number of attribute values that can be correctly guessed by an observer the same strategy but without any knowledge of the category labels.